Note on a machine algorithm for conversion from reflected binary to natural binary

On the Conversion between Binary Code and Binary-Reflected Gray Code on Boolean Cubes

We present a new algorithm for conversion between binary code and binary{re ected Gray code that requires approximately 2K 3 element transfers in sequence for K elements per node, compared to K element transfers for previously known algorithms. For a binary cube of n = 2 dimensions the new algorithm degenerates to yield a complexity of K 2 + 1 element transfers, which is optimal. The new algori...

A Fully Parallel Algorithm for Residue to Binary Conversion

Erratum Addendum to " A fully parallel algorithm for residue to binary conversion " The Publisher regrets that in the above-mentioned paper the name of the second author was inadvertently misspelled. The correct spelling is shown above.

A Note On Rémy's Algorithm For Generating Random Binary Trees

An improved algorithm to reconstruct a binary tree from its inorder and postorder traversals

It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...

An improved algorithm to reconstruct a binary tree from its inorder and postorder traversals

It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...